Single-Sink Fixed-Charge Transportation: Applications and Exact Solution Algorithms

نویسنده

  • Andreas Klose
چکیده

The single-sink fixed-charge transportation problem (SSFCTP) consists in finding a minimum cost flow from a number of supplier nodes to a single demand node. Shipping costs comprise costs proportional to the amount shipped as well as a fixed charge. Although the SSFCTP is an important special case of the well known fixed-charge transportation problem, only a few methods for solving this problem have been proposed in the literature. This paper first summarizes applications of the single-sink fixed charge transportation problem in the fields of purchasing, manufacturing, and transportation. Exact solution methods based on dynamic programming and implicit enumeration are afterwards discussed and improved by means of problem reduction techniques and additional bounds. Finally, the performance of the various solution methods is compared in a series of computational experiments.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Preferable-interval Approaches to the Single-sink Fixed-charge Transportation Problem

The single-sink fixed-charge transportation problem is an important problem with applications in many areas. In this paper, a new concept of preferable interval is introduced. Properties of optimal solutions to the single-sink fixed-charge transportation problem are investigated. Solution approaches using preferable intervals are presented.

متن کامل

Solving the Fixed Charge Transportation Problem by New Heuristic Approach

The fixed charge transportation problem (FCTP) is a deployment of the classical transportation problem in which a fixed cost is incurred, independent of the amount transported, along with a variable cost that is proportional to the amount shipped. Since the problem is considered as an NP-hard, the computational time grows exponentially as the size of the problem increases. In this pape...

متن کامل

Electromagnetism-like Algorithms for The Fuzzy Fixed Charge Transportation Problem

In this paper, we consider the fuzzy fixed-charge transportation problem (FFCTP). Both of fixed and transportation cost are fuzzy numbers. Contrary to previous works, Electromagnetism-like Algorithms (EM) is firstly proposed in this research area to solve the problem. Three types of EM; original EM, revised EM, and hybrid EM are firstly employed for the given problem. The latter is being firstl...

متن کامل

Analysis of some greedy algorithms for the single-sink fixed-charge transportation problem

The single-sink fixed-charge transportation problem (SSFCTP) consists in finding a minimum cost flow from a number of nodes to a single sink. Beside a cost proportional to the amount shipped, the flow cost encompass a fixed charge. The SSFCTP is an important subproblem of the well-known fixed-charge transportation problem. Nevertheless, just a few methods for solving this problem have been prop...

متن کامل

Modeling and solving a three-stage fixed charge transportation problem considering stochastic demand and price

This paper considers a three-stage fixed charge transportation problem regarding stochastic demand and price. The objective of the problem is to maximize the profit for supplying demands. Three kinds of costs are presented here: variable costs that are related to amount of transportation cost between a source and a destination. Fixed charge exists whenever there is a transfer from a source to a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006